


#include <iostream>
#include <vector>
#include <list>
#include <string>
#include <unordered_map>
using namespace std;


void Test1()
{
    int res = 0;
    int n = 0, m = 0;
    unordered_map<char, int> score{ {'l', 4}, {'o', 3}, {'v', 2}, {'e', 1} };
    cin >> n >> m;

    vector<vector<int>> dp(n + 1, vector<int>(m + 1));
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= m; ++j)
        {
            char ch = 0;
            cin >> ch;
            dp[i][j] = max(dp[i][j - 1], dp[i - 1][j]) + score[ch];
            res = max(dp[i][j], res);
        }
    }

    cout << res << endl;
}

void Test2()
{
    int res = 0;
    int a = 0, b = 0;
    cin >> a >> b;

    if (a == b)
    {
        res = a;
    }
    else
    {
        if (0 == a % b)
            res = a;
        else if (0 == b % a)
            res = b;
        else
        {
            if (a > b)
                swap(a, b);
            for (int i = a + 1; !(0 == i % a && 0 == i % b); ++i)
            {
                res = i;
            }
            ++res;
        };
    }

    cout << res << endl;
}

void Test3()
{
    long long res = 0;
    long long a = 0, b = 0;
    cin >> a >> b;
    long long a1 = a, b1 = b;

    for (int c = a % b; c;)
    {
        a = b;
        b = c;
        c = a % b;
    }
    res = a1 / b * b1;

    cout << res << endl;
}

int main()
{

	return 0;
}